Multiple Objective Linear Programming (MOLP) Problems with the Same Objective Space
نویسندگان
چکیده
منابع مشابه
A New Approach to Solve Multiple Objective Programming Problems
Multiple Objective Programming (MOP) problems have become famous among many researchers due to more practical and realistic implementations. There have been a lot of methods proposed especially during the past four decades. In this paper, we develop a new algorithm based on a new approach to solve MOP problems by starting from a utopian point (which is usually infeasible) and moving towards the...
متن کاملComputing efficient solutions to fuzzy multiple objective linear programming problems
In this paper, we improve the fuzzy compromise approach of Guu and Wu by automatically computing proper membership thresholds instead of choosing them. Indeed, in practice, choosing membership thresholds arbitrarily may result in an infeasible optimization problem. Although we can adjust minimum satisfaction degree to get fuzzy efficient solution, it sometimes makes the process of interactionmo...
متن کاملInteractive multiple objective programming in optimization of the fully fuzzy quadratic programming problems
In this paper, a quadratic programming (FFQP) problem is considered in which all of the cost coefficients, constraints coefficients, and right hand side of the constraints are characterized by L-R fuzzy numbers. Through this paper, the concept of α- level of fuzzy numbers for the objective function, and the order relations on the fuzzy numbers for the constraints are considered. To optimize th...
متن کاملUsing objective values to start multiple objective linear programming algorithms
We introduce in this paper a new starting mechanism for multiple-objective linear programming (MOLP) algorithms. This makes it possible to start an algorithm from any solution in objective space. The original problem is first augmented in such a way that a given starting solution is feasible. The augmentation is explicitly or implicitly controlled by one parameter during the search process, whi...
متن کاملGeometric Duality in Multiple Objective Linear Programming
We develop in this article a geometric approach to duality in Multiple Objective Linear Programming. This approach is based on a very old idea, the duality of polytopes, which can be traced back to the old Greeks. We show that there is an inclusion reversing one-to-one map between the minimal faces of the image of the primal objective and the maximal faces of the image of the dual objective map.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algorithms & Computational Technology
سال: 2009
ISSN: 1748-3026,1748-3026
DOI: 10.1260/174830109789621347